Constrained Tucker-3 model for blind beamforming
نویسندگان
چکیده
This paper presents a constrained Tucker-3 model for blind beamforming. The constrained structure of this model is parameterized by two constraint matrices that capture the spatial and temporal structure of the channel. We first present a generalized Tucker-3 model that considers a multipath propagation scenario with large delay spread and different number of paths per source. This tensor model generalizes the models of [N.D. Sidiropoulos, G.Z. Dimic, Blind multiuser detection in WCDMA systems with large delay spread, IEEE Signal Process. Lett. 8 (3) (2001) 87–89] and [A. de Baynast, L. De Lathauwer, Détection autodidacte pour des systèmes à accès multiple basée sur l’analyse PARAFAC, in: Proceedings of XIX GRETSI Symposium on Signal and Image Processing, Paris, France, 2003] by considering a more general multipath propagation scenario. From this general model, two particular cases can be derived by adjusting the constrained structure of the Tucker-3 core tensor. Identifiability of the proposed tensor model is studied and some simulation results are presented to illustrate the application of this model to blind beamforming. & 2008 Elsevier B.V. All rights reserved.
منابع مشابه
Blind Adaptive Beamforming Based on Constrained Constant Modulus RLS Algorithm for Smart Antennas
In this paper, we study the performance of blind adaptive beamforming algorithms for smart antennas in realistic environments. A constrained constant modulus (CCM) design criterion is described and used for deriving a recursive least squares (RLS) type optimization algorithm. Furthermore, two kinds of scenarios are considered in the paper for analyzing its performance. Simulations are performed...
متن کاملConstant Modulus Beamforming via Convex Optimization
We present novel convex-optimization-based solutions to the problem of blind beamforming of constant modulus signals, and to the related problem of linearly constrained blind beamforming of constant modulus signals. These solutions ensure global optimality and are parameter free, namely, do not contain any tuneable parameters and do not require any apriori parameter settings. The performance of...
متن کاملLow-Complexity Constrained Constant Modulus SG-based Beamforming Algorithms with Variable Step Size
In this paper, two low-complexity adaptive step size algorithms are investigated for blind adaptive beamforming. Both of them are used in a stochastic gradient (SG) algorithm, which employs the constrained constant modulus (CCM) criterion as the design approach. A brief analysis is given for illustrating their properties. Simulations are performed to compare the performances of the novel algori...
متن کاملLow-Complexity Variable Forgetting Factor Constrained Constant Modulus RLS Algorithm for Adaptive Beamforming
In this paper, a recursive least squares (RLS) based blind adaptive beamforming algorithm that features a new variable forgetting factor (VFF) mechanism is presented. The beamformer is designed according to the constrained constant modulus (CCM) criterion, and the proposed adaptive algorithm operates in the generalized sidelobe canceler (GSC) structure. A detailed study of its operating propert...
متن کاملThe KKT optimality conditions for constrained programming problem with generalized convex fuzzy mappings
The aim of present paper is to study a constrained programming with generalized $alpha-$univex fuzzy mappings. In this paper we introduce the concepts of $alpha-$univex, $alpha-$preunivex, pseudo $alpha-$univex and $alpha-$unicave fuzzy mappings, and we discover that $alpha-$univex fuzzy mappings are more general than univex fuzzy mappings. Then, we discuss the relationships of generalized $alp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Signal Processing
دوره 89 شماره
صفحات -
تاریخ انتشار 2009